Search results for " Conjugacy"

showing 10 items of 16 documents

Transitive Anosov flows and Axiom-A diffeomorphisms

2009

AbstractLet M be a smooth compact Riemannian manifold without boundary, and ϕ:M×ℝ→M a transitive Anosov flow. We prove that if the time-one map of ϕ is C1-approximated by Axiom-A diffeomorphisms with more than one attractor, then ϕ is topologically equivalent to the suspension of an Anosov diffeomorphism.

Pure mathematicsFlow (mathematics)Applied MathematicsGeneral MathematicsMathematical analysisAttractorBoundary (topology)Anosov diffeomorphismRiemannian manifoldTopological conjugacySuspension (topology)Axiom AMathematicsErgodic Theory and Dynamical Systems
researchProduct

Plane foliations with a saddle singularity

2012

Abstract We study the set of planar vector fields with a unique singularity of hyperbolic saddle type. We found conditions to assure that a such vector field is topologically equivalent to a linear saddle. Furthermore, we describe the plane foliations associated to these vector fields. Such a foliation can be split in two subfoliations. One without restriction and another one that is topologically characterized by means of trees.

Planar vector fieldsSingular foliationsPlane (geometry)Mathematical analysisPlanar vector fieldsType (model theory)SingularityFoliation (geology)Vector fieldGeometry and TopologyTopological conjugacySaddleMathematicsSaddle singularityTopology and its Applications
researchProduct

Combinatorial Models in the Topological Classification of Singularities of Mappings

2018

The topological classification of finitely determined map germs \(f:(\mathbb R^n,0)\rightarrow (\mathbb R^p,0)\) is discrete (by a theorem due to R. Thom), hence we want to obtain combinatorial models which codify all the topological information of the map germ f. According to Fukuda’s work, the topology of such germs is determined by the link, which is obtained by taking the intersection of the image of f with a small enough sphere centered at the origin. If \(f^{-1}(0)=\{0\}\), then the link is a topologically stable map \(\gamma :S^{n-1}\rightarrow S^{p-1}\) (or stable if (n, p) are nice dimensions) and f is topologically equivalent to the cone of \(\gamma \). When \(f^{-1}(0)\ne \{0\}\)…

PhysicsImage (category theory)010102 general mathematicsDimension (graph theory)Boundary (topology)Stable map01 natural sciencesManifold010101 applied mathematicsCombinatoricsCone (topology)0101 mathematicsTopological conjugacyWord (group theory)
researchProduct

Suffixes, Conjugates and Lyndon Words

2013

In this paper we are interested in the study of the combinatorial aspects connecting three important constructions in the field of string algorithms: the suffix array, the Burrows-Wheeler transform (BWT) and the extended Burrows-Wheeler transform (EBWT). Such constructions involve the notions of suffixes and conjugates of words and are based on two different order relations, denoted by $\plex$ and $\pom$, that, even if strictly connected, are quite different from the computational point of view. In this study an important role is played by Lyndon words. In particular, we improve the upper bound on the number of symbol comparisons needed to establish the $\pom$ order between two primitive wo…

MultisetReduction (recursion theory)BWT; Lyndon factorization; Suffix ArrayString (computer science)Suffix arrayLyndon words Lyndon factorization BWT Suffix array EBWT Circular words ConjugacyLexicographical orderlaw.inventionSuffix ArrayCombinatoricsBWTLyndon factorizationlawOrder (group theory)Symbol (formal)Word (group theory)Mathematics
researchProduct

A note on renewal systems

1992

Abstract A renewal system is a symbolic dynamical system generated by free concatenations of a finite set of words. In this paper we prove that, given two systems which are both renewal and Markov systems, it is decidable whether they are topologically conjugate. The proof makes use of the methods and the techniques of formal language theory.

Discrete mathematicsAlgebraGeneral Computer ScienceFormal languageMarkov systemsDynamical system (definition)Topological conjugacyFinite setComputer Science::Formal Languages and Automata TheoryDecidabilityMathematicsTheoretical Computer ScienceComputer Science(all)Theoretical Computer Science
researchProduct

Caractérisation des flots d' Anosov en dimension 3 par leurs feuilletages faibles

1995

AbstractWe consider Anosov flows on closed 3-manifolds. We show that if such a flow admits a weak foliation whose lifting in the universal covering is a product foliation, thenit is characterized up to topological equivalence by its weak stable foliation up to topological conjugacy. As a corollary we obtain that, up to topological equivalence and finite coverings, suspensions and geodesic flows are the unique Anosov flows on closed 3-manifolds whose weak stable foliations are transversely projective.

Pure mathematicsMathematics::Dynamical SystemsGeodesicApplied MathematicsGeneral MathematicsTopological equivalenceCorollaryFlow (mathematics)Product (mathematics)Foliation (geology)Mathematics::Differential GeometryTopological conjugacyMathematics::Symplectic GeometryMathematicsErgodic Theory and Dynamical Systems
researchProduct

A simple algorithm for generating neuronal dendritic trees

1990

Abstract A simple, efficient algorithm is presented for generating the codewords of all neuronal dendritic trees with a given number of terminal nodes. Furthermore, a procedure is developed for deciding if different codewords correspond to topologically equivalent trees.

Discrete mathematicsQuantitative Biology::Neurons and CognitionEfficient algorithmHealth InformaticsDendritesData_CODINGANDINFORMATIONTHEORYData structureModels BiologicalComputer Science ApplicationsTerminal (electronics)Simple (abstract algebra)Computer SimulationTopological conjugacyMathematical ComputingAlgorithmAlgorithmsSoftwareSIMPLE algorithmComputer Science::Information TheoryMathematicsComputer Methods and Programs in Biomedicine
researchProduct

Generalized iterated function systems on the spacel∞(X)

2014

Abstract In the last decades there has been a current effort to extend the classical Hutchinson theory of iterated function systems composed by contractions on a metric space X into itself to more general spaces and infinitely many mappings. In this paper we consider the (countable) iterated function systems consisting of some generalized contractions on the product space X I into X , where I is an arbitrary set of natural numbers. Some approximations of the attractors of the respective iterated function systems are given.

Discrete mathematicsHutchinson operatorMetric spaceIterated function systemCollage theoremApplied MathematicsCountable setContraction mappingTopological conjugacySpace (mathematics)AnalysisMathematicsJournal of Mathematical Analysis and Applications
researchProduct

Surface homeomorphisms with zero dimensional singular set

1998

We prove that if f is an orientation-preserving homeomorphism of a closed orientable surface M whose singular set is totally disconnected, then f is topologically conjugate to a conformal transformation.

Surface (mathematics)Pure mathematics[MATH.MATH-DS]Mathematics [math]/Dynamical Systems [math.DS][ MATH.MATH-DS ] Mathematics [math]/Dynamical Systems [math.DS]Conformal mapDynamical Systems (math.DS)01 natural sciencesKérékjártós theorySet (abstract data type)Totally disconnected spaceRegular homeomorphisms0103 physical sciencesFOS: Mathematics54H20; 57S10; 58FxxRiemann sphereMathematics - Dynamical Systems0101 mathematicsMathematics - General TopologyMathematics010102 general mathematicsGeneral Topology (math.GN)Zero (complex analysis)Applications conformesHomeomorphismHoméomorphismes des surfacesApplications conformes.Transformation (function)Limit set010307 mathematical physicsGeometry and Topology54H20 (Primary) 57S10 (Secondary) 58Fxx (Secondary)Topological conjugacy
researchProduct

Powers of conjugacy classes in a finite groups

2020

[EN] The aim of this paper is to show how the number of conjugacy classes appearing in the product of classes affect the structure of a finite group. The aim of this paper was to show several results about solvability concerning the case in which the power of a conjugacy class is a union of one or two conjugacy classes. Moreover, we show that the above conditions can be determined through the character table of the group.

Finite groupbusiness.industryApplied Mathematics010102 general mathematics4904 Pure MathematicsPower of conjugacy classes01 natural sciencesFinite groupsConjugacy classesMathematics::Group TheoryConjugacy classHospitalitySolvability0103 physical sciences49 Mathematical Sciences010307 mathematical physicsSociologyCharacters0101 mathematicsbusinessMATEMATICA APLICADAHumanitiesMatemàtica
researchProduct